/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 100;
string a, b;
ll next_s[maxn];
//得到模式串的next数组
void getnext(string s)
{
    ll len = s.length();
    next_s[0] = -1;
    ll i = 0, j = -1;
    while (i < len)
    {
        if (j == -1 || s[i] == s[j])
            next_s[++i] = ++j;
        else
            j = next_s[j];
    }
    return;
}

int main()
{
    IOS;
    ll ans = 0;
    cin >> a >> b;
    getnext(b);
    ll len1 = a.length();
    ll len2 = b.length();
    ll j = 0;
    // KMP
    for (ll i = 0; i < len1;)
    {
        if (j == -1 || a[i] == b[j])
        {
            i++;
            j++;
            if (j == len2)
            {
                ans++;
                j = next_s[j]; //关键：易错点
            }
        }
        else
            j = next_s[j];
    }
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}